YES 0.782
↳ HASKELL
↳ LR
((keysFM_GE :: FiniteMap () a -> () -> [()]) :: FiniteMap () a -> () -> [()]) |
import qualified Maybe import qualified Prelude |
|||||||||||||||||||
data FiniteMap a b = EmptyFM | Branch a b Int (FiniteMap a b) (FiniteMap a b) |
|||||||||||||||||||
instance (Eq a, Eq b) => Eq (FiniteMap a b) where |
|||||||||||||||||||
foldFM_GE :: Ord a => (a -> c -> b -> b) -> b -> a -> FiniteMap a c -> b
|
|||||||||||||||||||
keysFM_GE :: Ord b => FiniteMap b a -> b -> [b]
|
import qualified FiniteMap import qualified Prelude |
\keyeltrest→key : rest
keysFM_GE0 key elt rest = key : rest
↳ HASKELL
↳ LR
↳ HASKELL
↳ BR
((keysFM_GE :: FiniteMap () a -> () -> [()]) :: FiniteMap () a -> () -> [()]) |
import qualified Maybe import qualified Prelude |
|||||||||||||||||||
data FiniteMap b a = EmptyFM | Branch b a Int (FiniteMap b a) (FiniteMap b a) |
|||||||||||||||||||
instance (Eq a, Eq b) => Eq (FiniteMap b a) where |
|||||||||||||||||||
foldFM_GE :: Ord a => (a -> b -> c -> c) -> c -> a -> FiniteMap a b -> c
|
|||||||||||||||||||
keysFM_GE :: Ord a => FiniteMap a b -> a -> [a]
|
|||||||||||||||||||
|
import qualified FiniteMap import qualified Prelude |
↳ HASKELL
↳ LR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
((keysFM_GE :: FiniteMap () a -> () -> [()]) :: FiniteMap () a -> () -> [()]) |
import qualified Maybe import qualified Prelude |
|||||||||||||||||||
data FiniteMap b a = EmptyFM | Branch b a Int (FiniteMap b a) (FiniteMap b a) |
|||||||||||||||||||
instance (Eq a, Eq b) => Eq (FiniteMap b a) where |
|||||||||||||||||||
foldFM_GE :: Ord b => (b -> a -> c -> c) -> c -> b -> FiniteMap b a -> c
|
|||||||||||||||||||
keysFM_GE :: Ord b => FiniteMap b a -> b -> [b]
|
|||||||||||||||||||
|
import qualified FiniteMap import qualified Prelude |
foldFM_GE k z fr EmptyFM = z foldFM_GE k z fr (Branch key elt vw fm_l fm_r)
| key >= fr
= foldFM_GE k (k key elt (foldFM_GE k z fr fm_r)) fr fm_l | otherwise
= foldFM_GE k z fr fm_r
foldFM_GE k z fr EmptyFM = foldFM_GE3 k z fr EmptyFM foldFM_GE k z fr (Branch key elt vw fm_l fm_r) = foldFM_GE2 k z fr (Branch key elt vw fm_l fm_r)
foldFM_GE1 k z fr key elt vw fm_l fm_r True = foldFM_GE k (k key elt (foldFM_GE k z fr fm_r)) fr fm_l foldFM_GE1 k z fr key elt vw fm_l fm_r False = foldFM_GE0 k z fr key elt vw fm_l fm_r otherwise
foldFM_GE0 k z fr key elt vw fm_l fm_r True = foldFM_GE k z fr fm_r
foldFM_GE2 k z fr (Branch key elt vw fm_l fm_r) = foldFM_GE1 k z fr key elt vw fm_l fm_r (key >= fr)
foldFM_GE3 k z fr EmptyFM = z foldFM_GE3 wv ww wx wy = foldFM_GE2 wv ww wx wy
undefined
| False
= undefined
undefined = undefined1
undefined0 True = undefined
undefined1 = undefined0 False
↳ HASKELL
↳ LR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ Narrow
(keysFM_GE :: FiniteMap () a -> () -> [()]) |
import qualified Maybe import qualified Prelude |
|||||||||
data FiniteMap a b = EmptyFM | Branch a b Int (FiniteMap a b) (FiniteMap a b) |
|||||||||
instance (Eq a, Eq b) => Eq (FiniteMap b a) where |
|||||||||
foldFM_GE :: Ord a => (a -> c -> b -> b) -> b -> a -> FiniteMap a c -> b
|
|||||||||
|
|||||||||
|
|||||||||
|
|||||||||
|
|||||||||
keysFM_GE :: Ord b => FiniteMap b a -> b -> [b]
|
|||||||||
|
import qualified FiniteMap import qualified Prelude |
↳ HASKELL
↳ LR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
new_foldFM_GE1(wz6, @0, wz331, wz332, wz333, wz334, h) → new_foldFM_GE(wz331, new_foldFM_GE0(wz6, wz334, h), wz333, h)
new_foldFM_GE(wz31, wz5, Branch(wz330, wz331, wz332, wz333, wz334), h) → new_foldFM_GE1(new_keysFM_GE0(wz31, wz5, h), wz330, wz331, wz332, wz333, wz334, h)
new_foldFM_GE1(wz6, @0, wz331, wz332, wz333, Branch(wz3340, wz3341, wz3342, wz3343, wz3344), h) → new_foldFM_GE1(wz6, wz3340, wz3341, wz3342, wz3343, wz3344, h)
new_keysFM_GE0(wz31, wz5, h) → :(@0, wz5)
new_foldFM_GE0(wz6, EmptyFM, h) → wz6
new_foldFM_GE2(wz31, wz5, EmptyFM, h) → new_keysFM_GE0(wz31, wz5, h)
new_foldFM_GE2(wz31, wz5, Branch(wz330, wz331, wz332, wz333, wz334), h) → new_foldFM_GE10(new_keysFM_GE0(wz31, wz5, h), wz330, wz331, wz332, wz333, wz334, h)
new_foldFM_GE10(wz6, @0, wz331, wz332, wz333, wz334, h) → new_foldFM_GE2(wz331, new_foldFM_GE0(wz6, wz334, h), wz333, h)
new_foldFM_GE0(wz6, Branch(wz3340, wz3341, wz3342, wz3343, wz3344), h) → new_foldFM_GE10(wz6, wz3340, wz3341, wz3342, wz3343, wz3344, h)
new_foldFM_GE10(x0, @0, x1, x2, x3, x4, x5)
new_foldFM_GE0(x0, Branch(x1, x2, x3, x4, x5), x6)
new_foldFM_GE2(x0, x1, EmptyFM, x2)
new_keysFM_GE0(x0, x1, x2)
new_foldFM_GE2(x0, x1, Branch(x2, x3, x4, x5, x6), x7)
new_foldFM_GE0(x0, EmptyFM, x1)
From the DPs we obtained the following set of size-change graphs:
↳ HASKELL
↳ LR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
new_foldFM_GE3(@0, Branch(@0, wz31, wz32, wz33, wz34), h) → new_foldFM_GE3(@0, wz34, h)
From the DPs we obtained the following set of size-change graphs: